Constraint Based Approach for Optimized Planning-scheduling Problems

This paper outlines the way the planning/scheduling applications can be solved using the optimization potential of the Choco CSP solver. Consequently two specific problems which can be applied in various fields were described in this paper. The first one is a pure planning problem and supposes that a factory should manufacture products ordered by a client in the shortest time possible. The second one is a scheduling problem regarding simultaneous file transmission-visualization, where the task is to determine the start moments of the copy operations. The results show that both problems, otherwise difficult to solve in a classical way, can be solved readily using the CSP approach.